Artificial Bee Colony with Crossover Operations for Discrete Problems
نویسندگان
چکیده
The Artificial Bee Colony (ABC) is an algorithm designed to solve continuous problems. ABC has been proven be more effective than other biological-inspired algorithms. However, it needed modify its functionality in order a discrete problem. In this work, natural modification the original made make able Six neighborhood operators are proposed simulate behavior of ABC. Moreover, several Traveling Salesman Problem Library (TSPLIB) problems were used examine method. results method promising.
منابع مشابه
Discrete Artificial Bee Colony Optimization Algorithm for Financial Classification Problems
Nature-inspired methods are used in various fields for solving a number of problems. This study uses a nature-inspired method, artificial bee colony optimization that is based on the foraging behaviour of bees, for a financial classification problem. Financial decisions are often based on classification models, which are used to assign a set of observations into predefined groups. One important...
متن کاملArtificial Bee Colony (ABC) Algorithm with Crossover and Mutation
Artificial bee colony (ABC) is a relatively new swarm intelligence based metaheuristic. It was successfully applied to various, mostly continuous, optimization problems. For all such heuristically guided search algorithms balance between exploitation and exploration is the determining factor for success. It is generally considered that in the ABC algorithm exploitation is performed by employed ...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملA Discrete Artificial Bee Colony Algorithm for TSP Problem
In this paper, a new discrete artificial bee colony algorithm is used to solve the symmetric traveling salesman problem (TSP). The concept of Swap Operator has been introduced to the original artificial bee colony (ABC) algorithm which can help the bees to generate a better candidate tour by greedy selection. By taken six typical TSP instances as examples, the proposed algorithm is compared wit...
متن کاملA discrete artificial bee colony for multiple Knapsack problem
Multiple Knapsack Problem (MKP) is a most popular multiple subset selection problem that belongs to the class of NP-Complete problems. The aim is to assign optimal subsets among all original items to some knapsacks, such that the overall profit of all selected items be maximised, while the total weight of all assigned items to any knapsack does not exceed the allowable capacity of it. Artificia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering, Technology & Applied Science Research
سال: 2022
ISSN: ['1792-8036', '2241-4487']
DOI: https://doi.org/10.48084/etasr.5250